Implicit Abstraction Heuristics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implicit Abstraction Heuristics

State-space search with explicit abstraction heuristics is at the state of the art of costoptimal planning. These heuristics are inherently limited, nonetheless, because the size of the abstract space must be bounded by some, even if a very large, constant. Targeting this shortcoming, we introduce the notion of (additive) implicit abstractions , in which the planning task is abstracted by insta...

متن کامل

Implicit abstraction heuristics for cost-optimal planning

State-space search with explicit abstraction heuristics is at the state of the art of cost-optimal planning. These heuristics are inherently limited nonetheless, because the size of the abstract space must be bounded by some, even if very large, constant. Targeting this shortcoming, we introduce the notion of (additive) implicit abstractions, in which the planning task is abstracted by instance...

متن کامل

Refining abstraction heuristics with mutexes

Planning as heuristic search is a powerful approach to solve domain-independent planning problems. An important class of heuristics is based on abstractions of the original planning task. However it comes with loss in precision. The contribution of this thesis is the concept of constrained abstraction heuristics in general, and the application of this concept to pattern database and merge and s...

متن کامل

Abstraction-Based Heuristics with True Distance Computations

ion-Based Heuristics with True Distance Computations Ariel Felner and Max Barer Information Systems Engineering Deutsche Telekom Labs Ben-Gurion University Be’er-Sheva, Israel 85104 [email protected] Nathan Sturtevant and Jonathan Schaeffer Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2E8 {nathanst, jonathan}@cs.ualberta.ca

متن کامل

Flexible Abstraction Heuristics for Optimal Sequential Planning

We describe an approach to deriving consistent heuristics for automated planning, based on explicit search in abstract state spaces. The key to managing complexity is interleaving composition of abstractions over different sets of state variables with abstraction of the partial composites. The approach is very general and can be instantiated in many different ways by following different abstrac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2010

ISSN: 1076-9757

DOI: 10.1613/jair.3063